A memetic algorithm for a stochastic lot-sizing and sequencing problem
نویسندگان
چکیده
منابع مشابه
Multi-product sequencing and lot-sizing under uncertainties: A memetic algorithm
The paper deals with a stochastic multi-product sequencing and lot-sizing problem for a line that produces items in lots. Two types of uncertainties are considered: random lead time induced by machine breakdowns and random yield to take into account part rejects. In addition, sequence dependent setup times are also included. This study focuses on maximizing the probability of producing a requir...
متن کاملFix and Relax Heuristic for a Stochastic Lot-Sizing Problem
This paper addresses a particular stochastic lot-sizing and scheduling problem. The evolution of the uncertain parameters is modelled by means of a scenario tree and the resulting model is a multistage stochastic mixed-integer program. We develop a heuristic approach that exploits the specific structure of the problem. The computational experiments carried out on a large set of instances have s...
متن کاملA stochastic approach for the Lot Sizing problem
In this paper we extend the generalized surrogate optimization approaches and the stochastic comparison so as to tackle the lot-sizing problem in manufacturing system. In practice, with the surrogate methodology, the lot sizes are continuously adjusted on-line by the gradient-based approaches. The lot sizing determines the number of parts batched together for production. We utilize the queueing...
متن کاملA branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical (`, S) inequalities for the deterministic lot-sizing polytope are also valid for the stochastic lot-sizing polytope. We then extend the (`, S) inequalities to a general class of valid inequalities, called the (Q, SQ) inequalities, an...
متن کاملA dual algorithm for the economic lot-sizing problem
A linear description for the economic lot-sizing problem consisting of exponentially many linear inequalities was given by Barany, Van Roy and Wolsey in 1984. Using this formulation we present a dual algorithm for the economic lot-sizing problem, which is of the same complexity as the Wagner and Whitin dynamic programming algorithm. Besides its use in sensitivity analysis the dual algorithm als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.06.349